A counterexample to a geometric Hales-Jewett type conjecture
نویسنده
چکیده
Pór and Wood conjectured that for all k, l ≥ 2 there exists n ≥ 2 with the following property: whenever n points, no l + 1 of which are collinear, are chosen in the plane and each of them is assigned one of k colours, then there must be a line (that is, a maximal set of collinear points) all of whose points have the same colour. The conjecture is easily seen to be true for l = 2 (by the pigeonhole principle) and in the case k = 2 it is an immediate corollary of the Motzkin-Rabin theorem. In this note we show that the conjecture is false for k, l ≥ 3.
منابع مشابه
Induced lines in Hales-Jewett cubes
A line in [n]d is a set {x(1), . . . , x(n)} of n elements of [n]d such that for each 1 6 i 6 d, the sequence x i , . . . , x (n) i is either strictly increasing from 1 to n, or strictly decreasing from n to 1, or constant. How many lines can a set S ⊆ [n]d of a given size contain? One of our aims in this paper is to give a counterexample to the Ratio Conjecture of Patashnik, which states that ...
متن کاملA Variant of the Hales-jewett Theorem
It was shown by V. Bergelson that any set B ⊆ N with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each k ∈ N there exist a, b, d ∈ N such that ̆ b(a + id) : i, j ∈ {1, 2, . . . , k} ̄ ⊆ B. In particular one cell of each finite partition of N contains such configurations. We prove a Hales-Jewett type extension of this partition theorem.
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملThe First Nontrivial Hales-Jewett Number is Four
We show that whenever the length four words over a three letter alphabet are two-colored, there must exist a monochromatic combinatorial line. We also provide some computer generated lower bounds for some other Hales-Jewett numbers.
متن کاملA Note on Multiparty Communication Complexity and the Hales-Jewett Theorem
For integers n and k, the density Hales-Jewett number cn,k is defined as the maximal size of a subset of [k] that contains no combinatorial line. We prove a lower bound on cn,k, similar to the lower bound in [16], but with better dependency on k. The bound in [16] is roughly cn,k/k n ≥ exp(−O(log n)2 ) and we show cn,k/k n ≥ exp(−O(log n)). The proof of the bound uses the well-known constructio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JoCG
دوره 5 شماره
صفحات -
تاریخ انتشار 2014